Rearranging Dispatching Layout to Minimize Dispatching Time

Designing Dispatching Rules to Minimize Total Tardiness

We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite Dispatching Rules have been shown to be more effective as they are constructed through human experience. In this work, we employ s...

Dispatching and layout rules at an automated container terminal

We study an automated container terminal in which Automated Guided Vehicles (AGVs) are used to internally transport containers and Automated Stacking Cranes (ASCs) to store and retrieve containers. In designing container terminals, the terminal management has to consider the choice for interrelated AGV and ASC dispatching rules and the layout of the stack. In this paper, we, therefore, examine ...

Parametric Dispatching of Hard Real-Time Tasks

In many real-time systems, relative timing constraints are imposed on a set of tasks. Generating a correct ordering for the tasks and deriving their proper start-time assignments is a NP-hard problem; it subsumes the Non-preemptive Scheduling Problem. If a total order is imposed on the tasks and the exact execution times of tasks are known a priori, we can statically determine feasible start ti...

Online and Real-Time Dispatching Problems

Time and Space Efficient Multi-method Dispatching

The dispatching problem for object oriented languages is the problem of determining the most specialized method to invoke for calls at run-time. This can be a critical component of execution performance. A number of recent results, including [Muthukrishnan and Müller SODA’96, Ferragina and Muthukrishnan ESA’96, Alstrup et al. FOCS’98], have studied this problem and in particular provided variou...